Non-local length estimators and concave functions
نویسندگان
چکیده
منابع مشابه
Non-local estimators: A new class of multigrid convergent length estimators
An interesting property for curve length digital estimators is the convergence toward the continuous length and the associate convergence speed when the grid spacing tends to zero. On the one hand, DSS based estimators have been proved to converge but only under some convexity and smoothness or polygonal assumptions. On the other hand, we have introduced in a previous paper the sparse estimator...
متن کاملMoving Surfaces by Non-concave Curvature Functions
A convex surface contracting by a strictly monotone, homogeneous degree one function of curvature remains smooth until it contracts to a point in finite time, and is asymptotically spherical in shape. No assumptions are made on the concavity of the speed as a function of principal curvatures.
متن کاملCombining Estimators Using Non-Constant Weighting Functions
This paper discusses the linearly weighted combination of estimators in which the weighting functions are dependent on the input . We show that the weighting functions can be derived either by evaluating the input dependent variance of each estimator or by estimating how likely it is that a given estimator has seen data in the region of the input space close to the input pattern. The latter sol...
متن کاملThe Sugeno fuzzy integral of concave functions
The fuzzy integrals are a kind of fuzzy measures acting on fuzzy sets. They can be viewed as an average membershipvalue of fuzzy sets. The value of the fuzzy integral in a decision making environment where uncertainty is presenthas been well established. Most of the integral inequalities studied in the fuzzy integration context normally considerconditions such as monotonicity or comonotonicity....
متن کاملMaximizing Non-Linear Concave Functions in Fixed Dimension
Consider a convex set P in IR and a piecewise polynomial concave function F :P → IR. Let A be an algorithm that given a point x ∈ IR computes F (x) if x ∈ P, or returns a concave polynomial p such that p(x) < 0 but for any y ∈ P, p(y) ≥ 0. We assume that d is fixed and that all comparisons in A depend on the sign of polynomial functions of the input point. We show that under these conditions, o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.06.005